Double Roman Domination in Generalized Petersen Graphs P(ck, k)
نویسندگان
چکیده
A double Roman dominating function on a graph G=(V,E) is f:V?{0,1,2,3}, satisfying the condition that every vertex u for which f(u)=1 adjacent to at least one assigned 2 or 3, and with f(u)=0 3 two vertices 2. The weight of f equals sum w(f)=?v?Vf(v). minimum G called domination number ?dR(G) G. We obtain tight bounds in some cases closed expressions generalized Petersen graphs P(ck,k). In short, we prove ?dR(P(ck,k))=32ck+?, where limc??,k???ck=0.
منابع مشابه
Double Total Domination on Generalized Petersen Graphs
A set S of vertices in a graph G is a double total dominating set, abbreviated DTDS, of G if every vertex of G is adjacent to least two vertices in S. The minimum cardinality of a DTDS of G is the double total domination number of G. In this paper, we study the DTDS of the generalized Petersen graphs. Mathematics Subject Classification: 05C35
متن کاملRoman domination number of Generalized Petersen Graphs P(n, 2)
A Roman domination function on a graph G = (V,E) is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u with f(u) = 0 is adjacent to at least one vertex v with f(v) = 2. The weight of a Roman domination function f is the value f(V (G)) = ∑ u∈V (G) f(u). The minimum weight of a Roman dominating function on a graph G is called the Roman domination number of G, denoted by...
متن کاملWeak signed Roman k-domination in graphs
Let $kge 1$ be an integer, and let $G$ be a finite and simple graph with vertex set $V(G)$.A weak signed Roman $k$-dominating function (WSRkDF) on a graph $G$ is a function$f:V(G)rightarrow{-1,1,2}$ satisfying the conditions that $sum_{xin N[v]}f(x)ge k$ for eachvertex $vin V(G)$, where $N[v]$ is the closed neighborhood of $v$. The weight of a WSRkDF $f$ is$w(f)=sum_{vin V(G)}f(v)$. The weak si...
متن کاملRoman k-Tuple Domination in Graphs
For any integer $kgeq 1$ and any graph $G=(V,E)$ with minimum degree at least $k-1$, we define a function $f:Vrightarrow {0,1,2}$ as a Roman $k$-tuple dominating function on $G$ if for any vertex $v$ with $f(v)=0$ there exist at least $k$ and for any vertex $v$ with $f(v)neq 0$ at least $k-1$ vertices in its neighborhood with $f(w)=2$. The minimum weight of a Roman $k$-tuple dominatin...
متن کاملTotal double Roman domination in graphs
Let $G$ be a simple graph with vertex set $V$. A double Roman dominating function (DRDF) on $G$ is a function $f:Vrightarrow{0,1,2,3}$ satisfying that if $f(v)=0$, then the vertex $v$ must be adjacent to at least two vertices assigned $2$ or one vertex assigned $3$ under $f$, whereas if $f(v)=1$, then the vertex $v$ must be adjacent to at least one vertex assigned $2$ or $3$. The weight of a DR...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2022
ISSN: ['0865-4824', '2226-1877']
DOI: https://doi.org/10.3390/sym14061121